新生牛肝活性肽的制备及其毒性检测

目的制备新生牛肝活性肽并评价其安全性。方法采用膜法分离制备新生牛肝活性肽。将3批制品于37～40℃,75%相对湿度条件下存放3个月,以多肽含量为指标观察其稳定性,并进行急性毒性试验、小鼠骨髓细胞微核试验、Ames试验、小鼠精子畸形试验和大鼠喂养试验。结果制备的3批新生牛肝活性肽存放3个月后,多肽含量无明显下降,质量稳定。小鼠和大鼠经口灌人大于20.0g/kg体重的新生牛肝活性肽,均无急性毒性。3种致突变试验均未显示出致突变性,大鼠喂养试验各项指标均未见明显毒性。结论新生牛肝活性肽未表现出明显毒性。     

数值地形图的生成及其水文地貌特征评价

数值地形图(DEM)是利用地理信息系统(GIS)进行流域水文模拟的基础, 其精度直接影响模拟结果在没有现成的数值地形图时, 应用人员往往利用传统的地形图来生成它. 本文分别采用Arc/Info地理信息系统软件提供的哈奇逊法和不规则三角网五次插值法, 对一个实验流域的高程取样点进行插值, 生成了4种不同的数值地形图, 从凹洼分布、流域界定、河网提取、地面坡度和地形指数、以及地面径流汇成等方面, 对它们的水文地貌精度进行了比较. 结果表明, 两种方法都能生成由高程点群所反映的地形, 然而由于哈奇逊法能够结合流域的河网结构及其具有物理基础的水文地貌加强法来处理凹洼问题, 因此大大地提高了其所生成的流域数值地形图水文地貌特征精度.     

GPS/电子地图组合定位技术在侦察机器人系统中的应用

介绍了GPS／电子地图组合定位技术在侦察机器人系统中的应用。对GPS接收机进行二次开发，在WINDOWS环境下，基于VB6．0，利用通信控件捕获基准站和移动站的RTCM SC－104格式差分GPS电文。分析比较了几种GPS定位算法的优劣，根据侦察机器人系统的特点，选择逆向伪距差分算法对电文进行处理，并与电子地图相结合进行精确定位。对逆向伪距差分算法的实现做了详细介绍并对实验结果做了简要分析，在电子地图的管理上，提出了将监视区域二次划分的方法，利用BMP位图，对侦察机器人所在的方位进行可视化精确定位。     

Hard disc drive air bearing design: modified DIRECT algorithm and its application to slider air bearing surface optimization

Hard disk drives continue to increase in areal data density. This requires air bearing sliders with lower and lower flying heights (FH). Also the uniformity of the FH and the flatness of the roll profile with radius become more critical as the FH gets lower. By using modern optimization techniques, it is possible to optimize slider air bearing surface (ABS) designs according to multiple design goals. In this paper, we discuss two modifications to the DIRECT algorithm: one to handle tolerance and one to deal with hidden constraints. Some numerical experiments were carried out using these modifications and the modified DIRECT algorithm was applied to slider ABS optimization. The results show that these two modifications can improve the efficiency of the DIRECT algorithm and they also provide more flexibility in slider ABS optimization.     

非AWGN环境下调制类型自动识别

在非AWGN环境下，针对CW，AM，FM，OOK，PSK，QPSK，16QAM，FSK，MSK，SSB十种混合调制信号，对调制类型特征提取方法和自动识别算法进行了分析、综合、设计和计算机仿真。提出了梯层电平分析方法、频率瞬时信号分析、剔除载波的归一化能量分析、平方后信号的频谱分析、四次方后的信号频谱分析等方法。当SNR=10dB时，计算机仿真结果是正确识别率不低于95％，自动识别的平均处理时间为不超过10s。     

The Effects of Filtered Channel Quality Feedback on Throughput of Proportional Fair Algorithm

1　IntroductionSchedulingalgorithmsarewidelystudiedforwirelesspacketdatasystems,whichgenerallyhavetwobasiccategories,oneisoptimizedforsystemthroughputandfairness[1～ 2 ] ,andtheotherisforthequalityofservice[3～6] .Forsystemswherepack etdataaretimedivisionmultiplexedacrossusersonthedownlink ,orfromBaseStation (BS)tomultipleMobileStations(MS) ,theBSusesschedulingalgo rithmstodecidewhichuseristransmittedto .ItisindicatedinRefs.[7,8]thatschedulingonlyoneus eratatimeisoptimalfromthepointofviewo…     

基于遗传算法的图像边缘信息链表匹配技术

提出了一种基于遗传算法的图像边缘信息链表匹配方法。首先,采用CANNY算子的方法提取图像边缘;然后,将图像边缘信息链表化;最后,基于链表化结果利用遗传算法进行链表匹配。该方法能够减少匹配过程中的计算量,且能实现高效匹配。通过仿真实验,验证了该方法的性能。     

An adaptive non‐conforming finite‐element method for Reissner–Mindlin plates

Adaptive algorithms are important tools for efficient finite‐element mesh design. In this paper, an error controlled adaptive mesh‐refining algorithm is proposed for a non‐conforming low‐order finite‐element method for the Reissner–Mindlin plate model. The algorithm is controlled by a reliable and efficient residual‐based a posteriori error estimate, which is robust with respect to the plate's thickness. Numerical evidence for this and the efficiency of the new algorithm is provided in the sense that non‐optimal convergence rates are optimally improved in our numerical experiments. Copyright © 2003 John Wiley & Sons, Ltd.     

基于混合遗传算法的树状注水管网拓扑优化

以投资最小为目标函数,以井间隶属关系的惟一性、连接注水井数量等限制为约束条件,建立了树状注水管网拓扑优化数学模型.根据模型特点,将优化问题分为分配层和几何层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,采用随机多父辈适应函数值加权交叉和多种变异操作,结合了模拟退火算法,并给出了初温的确定方法,改进了选择复制操作,从而形成了混合遗传算法.该算法能够有效地提高收敛速度,避免早熟收敛.利用算例说明了该方法的有效性.     

On the design of multiple key hashing files for concurrent orthogonal range retrieval between two disks

This paper concerns the following problem: given a set of multi-attribute records, a fixed number of buckets and a two-disk system, arrange the records into the buckets and then store the buckets between the disks in such a way that, over all possible orthogonal range queries (ORQs), the disk access concurrency is maximized. We shall adopt the multiple key hashing (MKH) method for arranging records into buckets and use the disk modulo (DM) allocation method for storing buckets onto disks. Since the DM allocation method has been shown to be superior to any other allocation methods for allocating an MKH file onto a two-disk system for answering ORQs, the real issue is knowing how to determine an optimal way for organizing the records into buckets based upon the MKH concept.

A performance formula that can be used to evaluate the average response time, over all possible ORQs, of an MKH file in a two-disk system using the DM allocation method is first presented. Based upon this formula, it is shown that our design problem is related to a notoriously difficult problem, namely the Prime Number Problem. Then a performance lower bound and an efficient algorithm for designing optimal MKH files in certain cases are presented. It is pointed out that in some cases the optimal MKH file for ORQs in a two-disk system using the DM allocation method is identical to the optimal MKH file for ORQs in a single-disk system and the optimal average response time in a two-disk system is slightly greater than one half of that in a single-disk system.